Computational schemes for two exponential servers where the first has a finite buffer
نویسندگان
چکیده
منابع مشابه
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. (2004). We first derive an explicit expression for the Laplace-Stieltjes t...
متن کاملA Case for Buffer Servers
Faster networks and cheaper storage have brought us to a point where I/O caching servers have an important role in the design of scalable, high-performance file systems. These intermediary I/O servers — or buffer servers — can be deployed at strategic points in the network, interposed between clients and data sources such as standard file servers, Internet data servers, and tertiary storage. Th...
متن کاملNonstandard finite difference schemes for differential equations
In this paper, the reorganization of the denominator of the discrete derivative and nonlocal approximation of nonlinear terms are used in the design of nonstandard finite difference schemes (NSFDs). Numerical examples confirming then efficiency of schemes, for some differential equations are provided. In order to illustrate the accuracy of the new NSFDs, the numerical results are compared with ...
متن کاملComparison of two integration schemes for a micropolar plasticity model
Micropolar plasticity provides the capability to carry out post-failure simulations of geo-structures due to microstructural considerations and embedded length scale in its formulation. An essential part of the numerical implementation of a micropolar plasticity model is the integration of the rate constitutive equations. Efficiency and robustness of the implementation hinge on the type of int...
متن کاملA Finite Buffer Two Class Queue with Different Scheduling and Push-Out Schemes
We analyze an MI, M2/G1,G2/1/N queue with different scheduling and push-out scheme in this paper. Our work is motivated by the study of the performance of an output link of ATM switches with two-class priority traffics. The queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priority traffics. We can have general service time distri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2011
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/2011101